Around the simplex mean width conjecture

نویسنده

  • Alexander E. Litvak
چکیده

In this note we discuss an old conjecture in Convex Geometry asserting that the regular simplex has the largest mean width among all simplices inscribed into the Euclidean ball and its relation to Information Theory. Equivalently, in the language of Gaussian processes, the conjecture states that the expectation of the maximum of n + 1 standard Gaussian variables is maximal when the expectations of all pairwise products are −1/n, that is, when the Gaussian variables form a regular simplex in L2. We mention other conjectures as well, in particular on the expectation of the smallest (in absolute value) order statistic of a sequence of standard Gaussian variables (not necessarily independent), where we expect the same answer. AMS 2010 Classification: primary 52A23, 60G35, 94A12, 46B06; secondary 52A40, 60G15, 94A05, 46B09.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mean Width of Regular Polytopes and Expected Maxima of Correlated Gaussian Variables

An old conjecture states that among all simplices inscribed in the unit sphere the regular one has the maximal mean width. An equivalent formulation is that for any centered Gaussian vector (ξ1, . . . , ξn) satisfying Eξ2 1 = · · · = Eξ2 n = 1 one has E max{ξ1, . . . , ξn} ≤ √ n n− 1 E max{η1, . . . , ηn}, where η1, η2, . . . , are independent standard Gaussian variables. Using this probabilist...

متن کامل

On the Maximal Width of Empty Lattice Simplices

A k-dimensional lattice simplex σ ⊆ Rd is the convex hull of k + 1 affinely independent integer points. General lattice polytopes are obtained by taking convex hulls of arbitrary finite subsets of Zd . A lattice simplex or polytope is called empty if it intersects the lattice Zd only at its vertices. (Such polytopes are studied also under the names elementary and latticefree.) In dimensions d >...

متن کامل

M ay 2 00 2 SPHERE PACKINGS IV

1.1. The steps. The Kepler conjecture asserts that no packing of spheres in three dimensions has density greater than π/ √ 18 ≈ 0.74048. This paper is one of a series of papers devoted to the Kepler conjecture. This series began with [I], which proposed a line of research to prove the conjecture, and broke the conjecture into smaller conjectural steps which imply the Kepler conjecture. The step...

متن کامل

1 1 N ov 1 99 8 SPHERE PACKINGS IV

1.1. The steps. The Kepler conjecture asserts that no packing of spheres in three dimensions has density greater than π/ √ 18 ≈ 0.74078. This paper is one of a series of papers devoted to the Kepler conjecture. This series began with [I], which proposed a line of research to prove the conjecture, and broke the conjecture into smaller conjectural steps which imply the Kepler conjecture. The step...

متن کامل

An Introduction to Empty Lattice Simplices

We study simplices whose vertices lie on a lattice and have no other lattice points. Suchèmpty lattice simplices' come up in the theory of integer programming, and in some combi-natorial problems. They have been investigated in various contexts and under varying terminology Can thèemptiness' of lattice simplices bèwell-characterized' ? Is theirìattice-width' small ? Do the integer points of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017